Questioning Key Compromise Attack on Ostad-Sharif et al.’s Authentication and Session key Generation Scheme for Healthcare Applications
نویسندگان
چکیده
منابع مشابه
Generic Key Recovery Attack on Feistel Scheme
We propose new generic key recovery attacks on Feistel-type block ciphers. The proposed attack is based on the all subkeys recovery approach presented in SAC 2012, which determines all subkeys instead of the master key. This enables us to construct a key recovery attack without taking into account a key scheduling function. With our advanced techniques, we apply several key recovery attacks to ...
متن کاملRemarks on Zhang-Kim's Key Authentication Scheme
Key authentication is very important in secret communications and data security. Lee et al. proposed a new public key authentication scheme for cryptosystems based on discrete logarithms in 2003. Recently, Zhang et al. pointed out that Lee et al.’s scheme was not secure and proposed an improvement on it. However, in this paper, we will demonstrate that a dishonest user can forge the public key ...
متن کاملEphemeral key compromise attack on the IB-KA protocol
Recently, Dario Fiore and Rosario Gennaro proposed the IB-KA protocol, which was inspired by MQV protocol. They provide a full proof of security of IB-KA protocol using techniques developed by Krawczyk in the Canetti-Krawczyk model. They designed the IB-KA protocol with some security properties such as perfect forward secrecy, reflection attack resilience, and key compromise impersonation resil...
متن کاملSession - Key Generation using Human
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilistic polynomial-time adversaries that control the communication channel (between the parties), and may omit, insert and modify messages at their choice. Loosely speaking, the eeect of such an adversary that attacks an ...
متن کاملSecure Message Authentication Against Related-Key Attack
Security against related-key attacks is an important criteria for modern cryptographic constructions. In the related-key setting, the adversary has the ability to query the underlying function on the target key as well as on some related-keys. Although provable security against related-key attack has received considerable attention in recent years, most of the results in the literature aim to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2905731